全文获取类型
收费全文 | 1121篇 |
免费 | 456篇 |
国内免费 | 73篇 |
出版年
2024年 | 1篇 |
2023年 | 21篇 |
2022年 | 15篇 |
2021年 | 29篇 |
2020年 | 44篇 |
2019年 | 28篇 |
2018年 | 23篇 |
2017年 | 77篇 |
2016年 | 88篇 |
2015年 | 75篇 |
2014年 | 93篇 |
2013年 | 91篇 |
2012年 | 116篇 |
2011年 | 81篇 |
2010年 | 64篇 |
2009年 | 113篇 |
2008年 | 73篇 |
2007年 | 86篇 |
2006年 | 83篇 |
2005年 | 62篇 |
2004年 | 66篇 |
2003年 | 49篇 |
2002年 | 49篇 |
2001年 | 40篇 |
2000年 | 31篇 |
1999年 | 27篇 |
1998年 | 20篇 |
1997年 | 17篇 |
1996年 | 18篇 |
1995年 | 14篇 |
1994年 | 12篇 |
1993年 | 13篇 |
1992年 | 7篇 |
1991年 | 3篇 |
1990年 | 14篇 |
1989年 | 6篇 |
1988年 | 1篇 |
排序方式: 共有1650条查询结果,搜索用时 250 毫秒
51.
A genetic algorithm with neighborhood search for the resource‐constrained project scheduling problem
The resource‐constrained project scheduling problem (RCPSP) consists of a set of non‐preemptive activities that follow precedence relationship and consume resources. Under the limited amount of the resources, the objective of RCPSP is to find a schedule of the activities to minimize the project makespan. This article presents a new genetic algorithm (GA) by incorporating a local search strategy in GA operators. The local search strategy improves the efficiency of searching the solution space while keeping the randomness of the GA approach. Extensive numerical experiments show that the proposed GA with neighborhood search works well regarding solution quality and computational time compared with existing algorithms in the RCPSP literature, especially for the instances with a large number of activities. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011 相似文献
52.
We study a stochastic inventory model of a firm that periodically orders a product from a make‐to‐order manufacturer. Orders can be shipped by a combination of two freight modes that differ in lead‐times and costs, although orders are not allowed to cross. Placing an order as well as each use of each freight mode has a fixed and a quantity proportional cost. The decision of how to allocate units between the two freight modes utilizes information about demand during the completion of manufacturing. We derive the optimal freight mode allocation policy, and show that the optimal policy for placing orders is not an (s,S) policy in general. We provide tight bounds for the optimal policy that can be calculated by solving single period problems. Our analysis enables insights into the structure of the optimal policy specifying the conditions under which it simplifies to an (s,S) policy. We characterize the best (s,S) policy for our model, and through extensive numerical investigation show that its performance is comparable with the optimal policy in most cases. Our numerical study also sheds light on the benefits of the dual freight model over the single freight models. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011 相似文献
53.
王孔森 《中国人民武装警察部队学院学报》2011,(4):89-90
针对在火灾烟气和其他气态物质扩散的模拟研究中经常遇到正态分布的随机数的产生问题进行研究,探讨了特殊分布随机数的产生方法。特别给出了正态分布随机数的产生算法及其代码,并进行了验证。结果表明了所述产生正态随机数算法的可行性和可靠性。 相似文献
54.
55.
In many practical multiserver queueing systems, servers not only serve randomly arriving customers but also work on the secondary jobs with infinite backlog during their idle time. In this paper, we propose a c‐server model with a two‐threshold policy, denoted by (e d), to evaluate the performance of this class of systems. With such a policy, when the number of idle servers has reached d (<c), then e (<d) idle agents will process secondary jobs. These e servers keep working on the secondary jobs until they find waiting customers exist in the system at a secondary job completion instant. Using the matrix analytic method, we obtain the stationary performance measures for evaluating different (e, d) policies. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007. 相似文献
56.
MUSIC方法是空间谱估计中经典的子空间方法。提出了一种构造参考信号的预处理模型,提出了一种适合于MUSIC方法的多级维纳滤波结构。新方法避免了采样数据二阶统计的特征值分解,降低了运算量。仿真结果证明了方法的有效性。 相似文献
57.
58.
59.
60.